Branch & Bound Algorithm with Partial Prediction for Use with Recursive and Non-recursive Criterion Forms
نویسندگان
چکیده
We introduce a novel algorithm for optimal feature selection As op posed to our recent Fast Branch Bound FBB algorithm the new algorithm is well suitable for use with recursive criterion forms Even if the new algorithm does not operate as e ectively as the FBB algorithm it is able to nd the optimum signi cantly faster than any other Branch Bound algorithm
منابع مشابه
Fast Branch & Bound Algorithms for Optimal Feature Selection
A novel search principle for optimal feature subset selection using the Branch & Bound method is introduced. Thanks to a simple mechanism for predicting criterion values, a considerable amount of time can be saved by avoiding many slow criterion evaluations. We propose two implementations of the proposed prediction mechanism that are suitable for use with nonrecursive and recursive criterion fo...
متن کاملFast Branch & Bound Algorithm in Feature Selection
We introduce a novel algorithm for optimal subset selection. Due to its simple mechanism for predicting criterion values the algorithm finds optimum usually several times faster than any other known Branch & Bound [5], [7] algorithm. This behavior is expected when the algorithm is used in conjunction with non-recursive and/or computationally expensive criterion functions.
متن کاملThe Application of Recursive Mixed Models for Estimating Genetic and Phenotypic Relationships between Calving Difficulty and Lactation Curve Traits in Iranian Holsteins: A Comparison with Standard Mixed Models
In the present study, records on 22872 first-parity Holsteins collected from 131 herds by the Animal Breeding and Improvement Center of Iran from 1995 to 2014 were considered to estimate genetic and phenotypic relationships between calving difficulty (CD) and the lactation curve traits, including initial milk yield (Ap), ascending (Bp) and descending (Cp) slope of the lactation curves, peak mil...
متن کاملThe Impact of Buffering on Closest Pairs Queries Using R-Trees
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are investigated. Three buffer structures (i.e. single, hybrid and by levels) over two buffering schemes (i.e. local to each R-tree, and global to the query) using several page replacement algorithms (e.g. FIFO, LRU, 2Q,...
متن کاملOn The Simulation of Partial Differential Equations Using the Hybrid of Fourier Transform and Homotopy Perturbation Method
In the present work, a hybrid of Fourier transform and homotopy perturbation method is developed for solving the non-homogeneous partial differential equations with variable coefficients. The Fourier transform is employed with combination of homotopy perturbation method (HPM), the so called Fourier transform homotopy perturbation method (FTHPM) to solve the partial differential equations. The c...
متن کامل